منابع مشابه
An Imperative Object Calculus
1 Abstract. We develop an imperative calculus of objects. Its main type constructor is the one for object types, which incorporate variance annotations and Self types. A subtyping relation between object types supports object subsumption. The type system for objects relies on unusual but beneficial assumptions about the possible subtypes of an object type. With the addition of polymorphism, the...
متن کاملTracing sharing in an imperative pure calculus
We introduce a type and effect system, for an imperative object calculus, whichinfers sharing possibly introduced by the evaluation of an expression, repre-sented as an equivalence relation among its free variables. This direct represen-tation of sharing effects at the syntactic level allows us to express in a naturalway, and to generalize, widely-used notions in literature, not...
متن کاملAn Imperative , First - Order Calculus withObject
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simpliies the language presented in 17] in that, like C++ and Java, it chooses to support an imperative semantics instead of method specialization. We show how Java-style classes and \mixins" may be coded in this calculus, prove a...
متن کاملAn Imperative Core Calculus for Java
This technical report presents the specification of a programming language Cool: the Core Object-Oriented Language. Cool is a small language but retains many of the features of modern class-based object-oriented languages, including primitive types, classes, inheritance, objects, instance variables and methods, dynamic method binding, null and arrays, etc.. The specification for Cool in this re...
متن کاملImperative Program Transformation by Rewriting
We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expressions with simple patterns to matching blocks in a control flow graph. In order to express the complex restrictions on the applicability of these rewrites we add temporal logic side conditions. The combination of these features...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2008
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129508006750